Belt distance between facets of space-filling zonotopes

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Belt Distance Between Facets of Space-Filling Zonotopes

To every d-dimensional polytope P with centrally symmetric facets one can assign a “subway map” such that every line of this “subway” contains exactly the facets parallel to one of the ridges of P . The belt diameter of P is the maximum number of subway lines one needs to use to get from one facet to another. We prove that the belt diameter of a d-dimensional space-filling zonotope does not exc...

متن کامل

A Note on Space Tiling Zonotopes

In 1908 Voronoi conjectured that every convex polytope which tiles space face-to-face by translations is affinely equivalent to the Dirichlet-Voronoi polytope of some lattice. In 1999 Erdahl proved this conjecture for the special case of zonotopes. A zonotope is a projection of a regular cube under some affine transformation. In 1975 McMullen showed several equivalent conditions for a zonotope ...

متن کامل

Primitive Zonotopes

We introduce and study a family of polytopes which can be seen as a generalization of the permutahedron of type Bd. We highlight connections with the largest possible diameter of the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k, and with the computational complexity of multicriteria matroid optimization.

متن کامل

Space-filling Software Visualization

SeeSys TM is a system embodying a technique for visualizing statistics associated with code that is divided hierarchically into subsystems, directories, and les. This technique can display the relative sizes of the components in the system, the relative stability of the components, the location of new functionality, and the location of error-prone code with many bug xes. Using animation, it can...

متن کامل

Space Filling and Depletion

For a given k ≥ 1, subintervals of a given interval [0, X] arrive at random and are accepted (allocated) so long as they overlap fewer than k subintervals already accepted. Subintervals not accepted are cleared, while accepted subintervals remain allocated for random retention times before they are released and made available to subsequent arrivals. Thus, the system operates as a generalized ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Notes

سال: 2012

ISSN: 0001-4346,1573-8876

DOI: 10.1134/s0001434612090064